| abstract class $STACK{T} < $NR_STACK{T}, $REENTRANT |
|---|
| **** | NR: NR: abstract class $NR_STACK{T} < $DISPENSER{T} is An abstract stack |
| $REENTRANT | $NR_STACK{_} | $DISPENSER{_} | $STR | $CONTAINER{_} | $ELT{_} | $ELT |
| A_STACK{_} |
| copy: $STACK{T}; |
|---|
| **** | NR: copy: $NR_STACK{T}; Return a copy of the stack |
| elt!: T; |
|---|
| **** | Return the elements in the order in which successive "pop"s would yield them without actually removing the elements |
| is_empty: BOOL; |
|---|
| **** | True if size = 0 |
| pop: T; |
|---|
| **** | Return and remove the topmost element |
| push(elt: T); |
|---|
| **** | Push elt to the top of the stack |
| size: INT; |
|---|
| **** | Number of elements in the stack |
| top: T; |
|---|
| **** | Return the topmost element |
